Search for: All records

Abstract Supermassive black holes (SMBHs) are found in the centers of massive galaxies, and galaxy mergers should eventually lead to SMBH mergers. Quasar activity has long been associated with galaxy mergers, so here we investigate if supermassive black hole binaries (SMBHBs) are preferentially found in quasars. Our multimessenger investigation folds together a gravitational-wave background signal from NANOGrav, a sample of periodic active galactic nucleus candidates from the Catalina Real-Time Transient Survey, and a quasar mass function, to estimate an upper limit on the fraction of quasars which could host an SMBHB. We find at 95% confidence that quasars are at most 5 times as likely to host an SMBHB as a random galaxy. Pulsar timing arrays may therefore be more likely to find SMBHBs by prioritizing quasars over a random selection of galaxies in their searches. 

Abstract While supermassive black hole (SMBH) binaries are not the only viable source for the low-frequency gravitational wave background (GWB) signal evidenced by the most recent pulsar timing array (PTA) data sets, they are expected to be the most likely. Thus, connecting the measured PTA GWB spectrum and the underlying physics governing the demographics and dynamics of SMBH binaries is extremely important. Previously, Gaussian processes (GPs) and dense neural networks have been used to make such a connection by being built as conditional emulators; their input is some selected evolution or environmental SMBH binary parameters and their output is the emulated mean and standard deviation of the GWB strain ensemble distribution over many Universes. In this paper, we use a normalizing flow (NF) emulator that is trained on the entirety of the GWB strain ensemble distribution, rather than only mean and standard deviation. As a result, we can predict strain distributions that mirror underlying simulations very closely while also capturing frequency covariances in the strain distributions as well as statistical complexities such as tails, non-Gaussianities, and multimodalities that are otherwise not learnable by existing techniques. In particular, we feature various comparisons between the NF-based emulator and the GP approach used extensively in past efforts. Our analyses conclude that the NF-based emulator not only outperforms GPs in the ease and computational cost of training but also outperforms in the fidelity of the emulated GWB strain ensemble distributions. 

Pulsar timing arrays (PTAs) are ensembles of millisecond pulsars observed for years to decades. The primary goal of PTAs is to study gravitational-wave astronomy at nanohertz frequencies, with secondary goals of undertaking other fundamental tests of physics and astronomy. Recently, compelling evidence has emerged in established PTA experiments for the presence of a gravitational-wave background. To accelerate a confident detection of such a signal and then study gravitational-wave emitting sources, it is necessary to observe a larger number of millisecond pulsars to greater timing precision. The SKA telescopes, which will be a factor of three to four greater in sensitivity compared to any other southern hemisphere facility, is poised to make such an impact. In this chapter, we motivate an SKAO pulsar timing array (SKAO PTA) experiment. We discuss the classes of gravitational waves present in PTA observations and how an SKAO PTA can detect and study them. We then describe the sources that can produce these signals. We discuss the astrophysical noise sources that must be mitigated to undertake the most sensitive searches. We then describe a realistic PTA experiment implemented with the SKA and place it in context alongside other PTA experiments likely ongoing in the 2030s. We describe the techniques necessary to search for gravitational waves in the SKAO PTA and motivate how very long baseline interferometry can improve the sensitivity of an SKAO PTA. The SKAO PTA will provide a view of the Universe complementary to those of the other large facilities of the 2030s. 

Batching has a fundamental influence on the efficiency of deep neural network (DNN) execution. However, for dynamic DNNs, efficient batching is particularly challenging as the dataflow graph varies per input instance. As a result, state-of-the-art frameworks use heuristics that result in suboptimal batching decisions. Further, batching puts strict restrictions on memory adjacency and can lead to high data movement costs. In this paper, we provide an approach for batching dynamic DNNs based on finite state machines, which enables the automatic discovery of batching policies specialized for each DNN via reinforcement learning. Moreover, we find that memory planning that is aware of the batching policy can save significant data movement overheads, which is automated by a PQ tree-based algorithm we introduce. Experimental results show that our framework speeds up state-of-the-art frameworks by on average 1.15x, 1.39x, and 2.45x for chain-based, tree-based, and lattice-based DNNs across CPU and GPU. The framework is open-sourced at https://github.com/gulang2019/ED-Batch.git.